towards a measure of vulnerability, tenacity of a graph

Authors

dara moazzami

university of tehran, college of engineering, department of engineering science

abstract

if we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.in this paper we discuss tenacity and its properties in vulnerability calculation.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Towards a measure of vulnerability, tenacity of a Graph

If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...

full text

Vulnerability Measure of a Network - a Survey

In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where disruption of the graph is caused by the removal of a vertex or vertices (and the resulting...

full text

The edge tenacity of a split graph

The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...

full text

a tripartite model of efl teachers attributions, burnout, and ‎self-regulation: towards the prospects of effective teaching

همطالعه حاضر به ارائه مدلی برای آموزش موثر زبان انگلیسی ‏می پردازد. مدل حاضر از سه عامل تاثیر گذار در کارایی ‏تدریس معلمان زبان انگلیسی بهره می برد. این سه عامل شامل ‏سبکهای اسنادی، خود تنطیمی و فرسودگی شغلی معلمان ایرانی ‏زبان انگلیسی می باشد. رساله مورد نظر درچهار فاز طراحی ‏شده است: فاز اول شامل طراحی و رواسازی پرسشنامه سبکهای ‏اسنادی معلمان زبان انگلیسی و فاز دوم شامل استفاده از ‏این پرسشنا...

a comparison of linguistic and pragmatic knowledge: a case of iranian learners of english

در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...

15 صفحه اول

A Measure of Graph Vulnerability: Scattering Number

The scattering number of a graph G, denoted sc(G), is defined by sc(G)=max{c(G−S)− |S| : S ⊆ V(G) and c(G−S)≠ 1} where c(G−S) denotes the number of components in G− S. It is one measure of graph vulnerability. In this paper, general results on the scattering number of a graph are considered. Firstly, some bounds on the scattering number are given. Further, scattering number of a binomial tree i...

full text

My Resources

Save resource for easier access later


Journal title:
journal of algorithms and computation

جلد ۴۸، شماره ۱، صفحات ۱۴۹-۱۵۴

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023